Overlay Multicast Tree Minimizing Average Time Delay
نویسندگان
چکیده
In this work, we present an overlay multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems. At the same time, the proposed algorithm considers the computing power and the network condition of each end-system as a control variable and thus we can avoid the disastrous case that loads are concentrated to only several endsystems. The multicast tree is constructed by clustering technique and modified Dijkstra’s algorithm in two steps, i.e. tree among proxy-senders and tree in each cluster. By the experimental results, we show that the proposed algorithm can provide an effective solution.
منابع مشابه
Multicast tree rearrangement to recover node failures in overlay multicast networks
Overlay multicast makes use of the Internet as a low level infrastructure to provide multicast service to end hosts. The strategy of overlay multicast slides over most of the basic deployment issues associated with IP multicast, such as end-to-end reliability, flow and congestion control, and assignment of an unique address for each multicasting group. Since each multicast member is responsible...
متن کاملCharacterizing Overlay Multicast Networks
Overlay networks among cooperating hosts have recently emerged as a viable solution to several challenging problems, including multicasting, routing, content distribution, and peer-to-peer services. Application-level overlays, however, incur a performance penalty over router-level solutions. This paper characterizes this performance penalty for overlay multicast trees via experimental data, sim...
متن کاملAn overlay multicast protocol for live streaming and delay-guaranteed interactive media
In many collaborative multimedia applications, there is often a requirement for simultaneously supporting live streaming and shareable interaction. A major challenge in designing such an application by overlay multicast is how to simultaneously provide scalable live streaming and delay-guaranteed interactive media. Live streaming by overlay multicast incurs additional application-layer latency,...
متن کاملPerformance of edge-based multicast overlay trees for real time MPEG video distribution
This work proposes an edge-node multicast overlay to create a tree capable of performing point to multipoint distribution of real time video (i.e., videoconference) with a hard upper bound on end-to-end delay. By moving the tree configuration, replication, and network monitoring to the edge routers instead of end systems, the trees can be constructed using the knowledge of overlay link bandwidt...
متن کاملTHE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING Approximation and Heuristic Algorithms for Minimum Delay Application-Layer Multicast Trees
In this thesis we investigate the problem of finding minimum delay applicationlayer multicast trees, such as the trees constructed in overlay networks. It is widely accepted that shortest path trees are not a good solution for this problem since such trees can have nodes with very large degree, termed high load nodes. The load on these nodes makes them a bottleneck in the distribution tree, due...
متن کامل